By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.

Table of Contents
Volume 6, Issue 2, pp. 181-333

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Pathwidth and Treewidth of Cographs

Hans L. Bodlaender and Rolf H. Möhring

pp. 181-188

Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence $2$

Odile Favaron, Pedro Mago, Consuelo Maulino, and Oscar Ordaz

pp. 189-196

Limiting Distribution for the Depth in PATRICIA Tries

Bonita Rais, Philippe Jacquet, and Wojciech Szpankowski

pp. 197-213

Representations of Planar Graphs

Graham R. Brightwell and Edward R. Scheinerman

pp. 214-229

The Order Dimension of Convex Polytopes

Graham Brightwell and William T. Trotter

pp. 230-245

Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases

Peter Gritzmann and Bernd Sturmfels

pp. 246-269

Finding a Longest Path in a Complete Multipartite Digraph

G. Gutin

pp. 270-273

An Exact Characterization of Greedy Structures

Paul Helman, Bernard M. E. Moret, and Henry D. Shapiro

pp. 274-283

The Number of Maximal Independent Sets in Triangle-Free Graphs

Mihály Hujtera and Zsolt Tuza

pp. 284-288

Triangulating Three-Colored Graphs in Linear Time and Linear Space

Ramana M. Idury and Alejandro A. Schäffer

pp. 289-293

Barker Arrays I: Even Number of Elements

Jonathan Jedwab

pp. 294-308

Barker Arrays II: Odd Number of Elements

Jonathan Jedwab, Sheelagh Lloyd, and Miranda Mowbray

pp. 309-328

On the Enumeration of Steiner-Tree Topologies for the Points on a Circle

Kenneth R. Vollmar and Yanjun Zhang

pp. 329-333